Robot formation motion planning using Fast Marching
نویسندگان
چکیده
منابع مشابه
Robot formation motion planning using Fast Marching
This paper presents the application of the Voronoi Fast Marching method to Path Planning of Mobile Formation Robots. The Voronoi Fast Marching method uses the propagation of a wave (Fast Marching) operating on the world model to determine a motion plan over a viscosity map (similar to the refraction index in optics) extracted from the updated map model. The computational efficiency of the metho...
متن کاملFast Marching Trees: A Fast Marching Sampling-Based Method for Optimal Motion Planning in Many Dimensions
In this paper we present a novel probabilistic sampling-based motion planning algorithm called the Fast Marching Tree algorithm (FMT*). The algorithm is specifically aimed at solving complex motion planning problems in high-dimensional configuration spaces. This algorithm is proven to be asymptotically optimal and is shown to converge to an optimal solution faster than its state-of-the-art coun...
متن کاملFast Marching Tree: a Fast Marching Sampling-Based Method for Optimal Motion Planning in Many Dimensions
In this paper we present a novel probabilistic sampling-based motion planning algorithm called the Fast Marching Tree algorithm (FMT∗). The algorithm is specifically aimed at solving complex motion planning problems in high-dimensional configuration spaces. This algorithm is proven to be asymptotically optimal and is shown to converge to an optimal solution faster than its state-of-the-art coun...
متن کاملMobile Robot Online Motion Planning Using Generalized Voronoi Graphs
In this paper, a new online robot motion planner is developed for systematically exploring unknown environ¬ments by intelligent mobile robots in real-time applications. The algorithm takes advantage of sensory data to find an obstacle-free start-to-goal path. It does so by online calculation of the Generalized Voronoi Graph (GVG) of the free space, and utilizing a combination of depth-first an...
متن کاملPlanning robot formations with fast marching square including uncertainty conditions
This paper presents a novel algorithm to solve the robot formation path planning problem working under uncertainty conditions such as errors the in robot’s positions, errors when sensing obstacles or walls, etc. The proposed approach provides a solution based on a leader-followers architecture (real or virtual leaders) with a prescribed formation geometry that adapts dynamically to the environm...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Robotics and Autonomous Systems
سال: 2011
ISSN: 0921-8890
DOI: 10.1016/j.robot.2011.05.011